package com.atguigu.suanfa;

/**
 * @Author: lijunyao
 * LeetCode第一题：两数之和
 * 两个for循环 o(n平方)
 */
public class Solution {

    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (nums[i] + nums[j] == target) {
                    return new int[]{i, j};
                }
            }
        }
        return null;

    }
}